Primitive sets with large counting functions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Primitive Sets with Large Counting Functions

A set of positive integers is said to be primitive if no element of the set is a multiple of another. If S is a primitive set and S(x) is the number of elements of S not exceeding x, then a result of Erdős implies that ∫∞ 2 (S(t)/t log t) dt converges. We establish an approximate converse to this theorem, showing that if F satisfies some mild conditions and ∫∞ 2 (F (t)/t log t) dt converges, th...

متن کامل

On the Counting Function of Primitive Sets of Integers

Erdo s has shown that for a primitive set A/N a # A 1 (a log a)<const. This implies that A(x)<x (log log x log log log x) for infinitely many x. We prove that this is best possible apart from a factor (log log log x). 1999 Academic Press

متن کامل

On Relatively Prime Sets Counting Functions

This work is motivated by Nathanson’s recent paper on relatively prime sets and a phi function for subsets of {1, 2, 3, . . . , n}. We establish enumeration formulas for the number of relatively prime subsets and the number of relatively prime subsets of cardinality k of {1, 2, 3, . . . , n} under various constraints. Further, we show how this work links up with the study of multicompositions. ...

متن کامل

Counting Primitive Partial Words

A word is primitive if it is not a power of another word. The number of primitive words of a fixed length over an alphabet of a fixed size is well known and relates to the Möbius function. In this paper, we investigate the number of primitive partial words which are strings that may contain “do not know” symbols.

متن کامل

Counting Meromorphic Functions with Critical Points of Large Multiplicities

We study the number of meromorphic functions on a Riemann surface with given critical values and prescribed multiplicities of critical points and values. When the Riemann surface is CP1 and the function is a polynomial, we give an elementary way of finding this number. In the general case, we show that, as the multiplicities of critical points tend to infinity, the asymptotic for the number of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Publicationes Mathematicae Debrecen

سال: 2011

ISSN: 0033-3883

DOI: 10.5486/pmd.2011.5051